Consistency and Characterization of the Core of Two-Sided Matching Problems*
نویسندگان
چکیده
A characterization theorem of the core of two-sided matching problems is proved. The theorem characterizes the core by means of four axioms, the Pareto optimality, consistency, converse consistency, and anonymity. It is shown that all of them are logically independent.
منابع مشابه
Consistency and Monotonicity in One-Sided Assignment Problems
One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to one-sided assignment problems as Sasaki (1995) for two-sided assignment problems and we analyze various...
متن کاملVon Neumann-Morgenstern stable sets in matching problems
The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characteriz...
متن کاملMinimal conversely consistent extension of the men-optimal solution
In this paper we study two-sided, one-to-one matching problems and consider the most wellknown solution concept: the men-optimal solution. The men-optimal solution fails to satisfy consistency as well as converse consistency. Thanks to Sasaki and Toda (1992), we know that the minimal consistent extension of the men-optimal solution equals the core (Thomson, 1994a). In this paper, we compute the...
متن کاملThe Core Matchings of Markets with Transfers
We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching ν, if, for each agent i there exists a matching μ in the set for which μ (i) = ν (i), then ν is in the set. A set of matchings satisfies consistency if and only i...
متن کاملThe new implicit finite difference scheme for two-sided space-time fractional partial differential equation
Fractional order partial differential equations are generalizations of classical partial differential equations. Increasingly, these models are used in applications such as fluid flow, finance and others. In this paper we examine some practical numerical methods to solve a class of initial- boundary value fractional partial differential equations with variable coefficients on a finite domain. S...
متن کامل